Translation of resolution proofs into short first-order proofs without choice axioms
نویسندگان
چکیده
منابع مشابه
Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms
I present a way of generating proofs from resolution proofs containing Skolemization. The resulting proofs are purely first-order, i.e. do not make use of ’choice axioms’, ’satisfiability preserving proof steps’, etc. The resulting firts-order proofs are short, i.e. polynomial in the output of the theorem prover.
متن کاملOptimization and Translation of Tableau-Proofs into Resolution
Diierent kinds of logical calculi have diierent advantages and disadvantages. So calculi with a large number of derivation rules have a large scope for searching proofs, but in most cases it is possible to nd short proofs. It should be useful to translate the structures created during the proof in one system into structures of another system in order to examine attributes of proofs in these sys...
متن کاملShort Proofs Without New Variables
Adding and removing redundant clauses is at the core of state-of-the-art SAT solving. Crucial is the ability to add short clauses whose redundancy can be determined in polynomial time. We present a characterization of the strongest notion of clause redundancy (i.e., addition of the clause preserves satisfiability) in terms of an implication relationship. By using a polynomial-time decidable imp...
متن کاملNo Choice: Reconstruction of First-order ATP Proofs without Skolem Functions
Proof assistants based on higher-order logic frequently use first-order automated theorem provers as proof search mechanisms. The reconstruction of the proofs generated by common tools, such as MESON and Metis, typically involves the use of the axiom of choice to simulate the Skolemisation steps. In this paper we present a method to reconstruct the proofs without introducing Skolem functions. T...
متن کاملFirst-Order Proofs for Higher-Order Languages
We study the use of the-calculus for semantical descriptions of higher-order concurrent languages with state. As an example, we choose Concurrent Idealized ALGOL (CIA). CIA is particularly interesting as, yet being a core language, it combines imperative and parallel features with a procedural mechanism of full higher order. It can thus be used as a formal model for concurrent programs as, e.g....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information and Computation
سال: 2005
ISSN: 0890-5401
DOI: 10.1016/j.ic.2004.10.011